A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem
نویسندگان
چکیده
منابع مشابه
A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem
In a previous paper (Araujo et al. 2007), the authors proposed a lot sizing and sequencing model for a production process where a key material is prepared and then transformed into different final items. The lot sizing decisions concern not only the production of final items, but also that of the prepared material in order to take account of their sequence-dependent setup costs and times. The n...
متن کاملJoint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups
A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally teste...
متن کاملModeling and Analyzing Incremental Quantity Discounts in Transportation Costs for a Joint Economic Lot Sizing Problem
Joint economic lot sizing (JELS) addresses integrated inventory models in a supply chain. Most of the studies in this field either do not consider the role of the transportation cost in their analysis or consider transportation cost as a fixed part of the ordering costs. In this article, a model is developed to analyze an incremental quantity discount in transportation cost. Appropriate equatio...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملTabu Search for a Discrete Lot Sizing and Scheduling Problem
In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2013
ISSN: 0360-8352
DOI: 10.1016/j.cie.2013.04.003